Restricted Limits on Natural Functions with Arithmetical Graphs

نویسنده

  • Jerzy Mycka
چکیده

In this paper we consider the process of defining natural functions by the operation of infinite limit: F (x̄) = limy→∞,y∈A f(x̄, y) (also limes inferior and limes superior are taken into account). But two restrictions are assumed: the given natural function f has a graph belonging to some stage of an arithmetical hierarchy, the index of a limit runs only through a given arithmetical subset A of natural numbers. We investigate the arithmetical class of the graph of the function F , where the respective classes of the graph of f and the set A are known. The corollary for the Turing degrees of F is formulated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Abelian L-Functions For Number Fields

In this paper we introduce non-abelian zeta functions and more generally non-abelian L-functions for number fields, based on geo-arithmetical cohomology, geo-arithmetical truncation and Langlands’ theory of Eisenstein series. More precisely, in Chapter I, we start with a new yet natural geo-arithmetical cohomology and a geo-arithmetical stability in order to define genuine non-abelian zeta func...

متن کامل

Connectedness in graph limits

We define direct sums and a corresponding notion of con-nectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric functions on a probability space; there are natural definitions of direct sums and connectedness for such functions, and there is a perfect correspondence with the...

متن کامل

Connectedness in graph limits

We define direct sums and a corresponding notion of con-nectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric functions on a probability space; there are natural definitions of direct sums and connectedness for such functions, and there is a perfect correspondence with the...

متن کامل

Connectedness in Graph Limits

We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric functions on a probability space; there are natural definitions of direct sums and connectedness for such functions, and there is a perfect correspondence with the ...

متن کامل

On the Symmetry of Arithmetical Functions

We study the symmetry in short intervals of arithmetic functions with non-negative exponential sums. 1. Introduction and statement of the results. We pursue the study of the symmetry in (almost all) short intervals of arithmetical functions f (see [C1]), where this time we give (non-trivial) results for a new class of such (real) f ; the key-property they have is a non-negative exponential sum ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Revista Colombiana de Computación

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2003